Accessibility setting

Section: Software

SEA

Together with E. Schost and L. DeFeo, F. Morain has developed a new implementation of the SEA algorithm that computes the cardinality of elliptic curves over finite fields (large prime case, case $p=2$). It uses NTL and includes the more recent algorithms for solving all subtasks. The large prime case is relevant to cryptographical needs. The $p=2$ case, though not directly useful, is a good testbed for the FAAST program of LDeFeo (see 5.4 ). This program forms a gforge project.